Pairwise Point Cloud Registration Using Graph Matching and Rotation-Invariant Features
نویسندگان
چکیده
Registration is a fundamental but critical task in point cloud processing, which usually depends on finding element correspondence from two clouds. However, the of reliable relies establishing robust and discriminative description elements correct matching corresponding elements. In this letter, we develop coarse-to-fine registration strategy, utilizes rotation-invariant features new weighted graph method for iteratively correspondence. method, similarity nodes edges Euclidean feature space are formulated to construct optimization function. The proposed strategy evaluated using benchmark datasets compared with several state-of-the-art methods. Regarding experimental results, our can achieve fine rotation errors less than 0.2 degrees translation 0.1m.
منابع مشابه
A novel point cloud registration using 2D image features
Since a 3D scanner only captures a scene of a 3D object at a time, a 3D registration for multi-scene is the key issue of 3D modeling. This paper presents a novel and an efficient 3D registration method based on 2D local feature matching. The proposed method transforms the point clouds into 2D bearing angle images and then uses the 2D feature based matching method, SURF, to find matching pixel p...
متن کاملICP Registration Using Invariant Features
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwise correspondences are chosen as the closest point with respect to a weighted linear combination of positional and feature distances. It is shown that under ideal noise-free conditions, correspondences formed using this distance function are correct...
متن کاملGraph and point cloud matching for image registration PhD thesis proposal
In this document, we discuss the registration of images using graph and point cloud matching, with a special focus on medical imaging applications. Several parts of the human body present tree-like structures such as neuronal or pulmonary trees, retinal fundus, or blood vessels. There is a high interest in registering these structures due to many issues or limitations – acquiring images of the ...
متن کاملRotation-invariant pattern matching using wavelet decomposition
Pixel-by-pixel template matching is very time-consuming. For an input image of size N N × , and the template of size W W × , the computational complexity is O( 2 2 N W‧ ), given that the object orientations in both images are coincident. When we search an object with unknown orientation, the straightforward way to do template matching is to rotate the reference template in every possible orient...
متن کاملSmooth Simultaneous Structural Graph Matching and Point-Set Registration
We present a graph matching method that encompasses both a model of structural consistency and a model of geometrical deformations. Our method poses the graph matching problem as one of mixture modelling which is solved using the EM algorithm. The solution is then approximated as a succession of assignment problems which are solved, in a smooth way, using Softassign. Our method allows us to det...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Geoscience and Remote Sensing Letters
سال: 2022
ISSN: ['1558-0571', '1545-598X']
DOI: https://doi.org/10.1109/lgrs.2021.3109470